Featherweight Java

Constructive Foundations for Featherweight Java

In this paper we present a recursion-theoretic denotational semantics for Featherweight Java. Our interpretation is based on a formalization of the object model of Castagna, Ghelli and Longo in a predicative theory of types and names. Although this theory is prooftheoretically weak, it allows to prove many properties of programs written in Featherweight Java. This underpins Feferman’s thesis th...

Java & Lambda: a Featherweight Story

We present FJ&λ, a new core calculus that extends Featherweight Java (FJ) with interfaces, supporting multiple inheritance, λ-expressions, and intersection types. Our main goal is to formalise how lambdas and intersection types are grafted on Java 8, by studying their properties in a formal setting. We show how intersection types play a significant role in several cases, in particular in the ty...

A Module Calculus for Featherweight Java Towards Smart Java Packages

Featherweight Java A Minimal Core Calculus for Java and GJ

Several recent studies have introduced lightweight ver sions of Java reduced languages in which complex fea tures like threads and re ection are dropped to enable rigorous arguments about key properties such as type safety We carry this process a step further omitting almost all features of the full language including inter faces and even assignment to obtain a small calculus Featherweight Java...

Semantic Types and Approximation for Featherweight Java

We consider semantics for the class-based object-oriented calculus Featherweight Java (without casts) based uponapproximation. We also define an intersection type assignment system for this calculus and show that it satisfies subjectreduction and expansion, i.e. types are preserved under reduction and its converse. We establish a link between typeassignment and the approximation sem...